Display 3/L/1
    864866  83h#03027
  Nonmonotonic logic. II. Nonmonotonic modal theories.
  McDermott, Drew
  J. Assoc. Comput. Mach.,    1982,    29,  no.  1,    33 -  57.
ISSN: 0004-5411   CODEN: JACOAH
  Document Type: Journal
  From  the  summary:   ''Traditional  logics  suffer  from  the
'monotonicity   problem':    new  axioms  never  invalidate  old
theorems.  One way to get rid  of  this  problem  is  to  extend
traditional  modal  logic  in the following way.  The operator M
(usually read 'possible')   is  extended  so  that  Mp  is  true
whenever  p  is consistent with the theory.  Then any theorem of
this form may be invalidated if {sim}p is  added  as  an  axiom.
This  extension  results in nonmonotonic versions of the systems
T, S4,  and S5.  These systems are complete in that a theorem is
provable  in a theory based on one of them just if it is true in
all 'noncommittal'  models of that theory,  where a noncommittal
model  is  one in which as many things are possible as possible.
Nonmonotonic S4 is probably the most interesting of  the  three,
since  it  is  stronger  than  ordinary S4 but has all the usual
inferential machinery of S4. This approach to nonmonotonic logic
may be applied to several problems in  knowledge  representation
                                            For more, enter PAGE
 
?⊃
             Display 3/L/2
    857307  83e#68138
  A logic for default reasoning.
  Reiter, R.
  Artificial Intelligence,   1980,   13, no.  1-2,    81 -  132.
ISSN: 0004-3702   CODEN: AINTBB
  Document Type: Journal
  Special issue on nonmonotonic logic.
  Author's summary:  ''The need to make default  assumptions  is
frequently encountered in reasoning about incompletely specified
worlds.   Inferences  sanctioned  by  default are best viewed as
beliefs which may well be modified  or  rejected  by  subsequent
observations.    It   is   this  property  which  leads  to  the
nonmonotonicity of any logic of defaults.
  ''In this paper we propose a logic for default reasoning.   We
then  specialize our treatment to a very large class of commonly
occurring defaults.  For this class we develop a complete  proof
theory  and  show how to interface it with a top down resolution
theorem prover.  Finally,  we provide criteria under  which  the
revision of derived beliefs must be effected.''
  Reviewer: Author's summary
  Descriptors:     *COMPUTER    SCIENCE   (including   AUTOMATA)
-Artificial   intelligence     --Theorem    proving     (68G15);
                                            For more, enter PAGE
 
?⊃
             Display 3/L/3
    826396  82i#68056
  Extended inference modes in reasoning by computer systems.
  Winograd, Terry
  Artificial Intelligence,   1980,   13, no. 1-2,   5 - 26.
  Document Type: Journal
  Special issue on nonmonotonic logic.
  This  paper  is  a  basic tutorial survey of process-dependent
reasoning in AI systems.  Such reasoning is of course crucial in
cognitive  systems.   See also the author's book with F.  Flores
(Understanding computers and cognition, Ablex, Norwood, N.J., to
appear).
  Reviewer: JOEL, J. S. (Ann Arbor, Mich.)
  Descriptors:    *COMPUTER   SCIENCE    (including    AUTOMATA)
-Artificial   intelligence    --Pattern   recognition,    speech
recognition (68G10);  GENERAL --Methodology  and  philosophy  of
mathematics    (00A25);    BIOLOGY   AND   BEHAVIORAL   SCIENCES
--Psychology (92A25)
 
?⊃
             Display 3/L/4
    790389  81j#68114
  Prolegomena to a theory of mechanized formal reasoning.
  Weyhrauch, Richard W.
  Artificial Intelligence,   1980,   13, no. 1-2,   133 - 170.
  Document Type: Journal
  Special issue on nonmonotonic logic.
  Author's  summary:   ''This  is an informal description of the
author's ideas about using formal logic as a tool for  reasoning
systems  using computers.  The theoretical ideas are illustrated
by the features of FOL.  All  of  the  examples  presented  have
actually run using the FOL system.''
  Reviewer: Author's summary
  Descriptors:     *COMPUTER    SCIENCE   (including   AUTOMATA)
-Artificial   intelligence     --Theorem    proving     (68G15);
MATHEMATICAL LOGIC AND FOUNDATIONS -General logic --Mechanics of
proofs and logical operations (03B35)
 
?⊃
             Display 3/L/5
    788033  81j#03046
  The mathematics of nonmonotonic reasoning.
  Davis, Martin
  Artificial Intelligence,   1980,   13, no. 1-2,   73 - 80.
  Document Type: Journal
  Special issue on nonmonotonic logic.
  This  note  has  two parts.  In the first,  the author studies
minimal  entailment  and  minimal  completion  suggested  by  J.
McCarthy  (same  journal  13  (1980),   no.  1-2,  27 -  39;  MR
81i:03036a) (now included in his notion of circumscription).  In
the second part,  the nonmonotonic logic of D.  McDermott and J.
Doyle (03045 above)  is discussed.   According  to  the  author,
''McCarthy  attempts  to  capture  an  idea  inherent in Occam's
razor:  only those objects should be assumed to exist which  are
minimally required by the context.  McDermott and Doyle approach
the problem by discussing provability as a modality.''
  Reviewer: COSTA(DA), N. C. A. (Sao Paulo)
  Descriptors:  *MATHEMATICAL  LOGIC  AND  FOUNDATIONS  -General
logic  --Other  nonclassical  logic  (03B60);   COMPUTER SCIENCE
(including AUTOMATA) -Artificial intelligence  --Problem solving
(68G20)
 
?⊃
             Display 3/L/6
    788032  81j#03045
  Nonmonotonic logic. I.
  McDermott, Drew; Doyle, Jon
  Artificial Intelligence,   1980,   13, no. 1-2,   41 - 72.
  Document Type: Journal
  Special issue on nonmonotonic logic.
  Authors' summary: '' 'Nonmonotonic' logical systems are logics
in  which  the  introduction  of  new  axioms can invalidate old
theorems. Such logics are very important in modeling the beliefs
of active processes which,  acting in the presence of incomplete
information,   must  make and subsequently revise assumptions in
light of new observations. We present the motivation and history
of such logics.  We develop model and proof theories,   a  proof
procedure,   and  applications  for  one nonmonotonic logic.  In
particular,  we  prove  the  completeness  of  the  nonmonotonic
predicate  calculus  and  the  decidability  of the nonmonotonic
sentential calculus.  We also discuss characteristic  properties
of this logic and its relationship to stronger logics, logics of
incomplete information, and truth maintenance systems.''
  (Reviewer's  remark:   It  would  be  interesting to study the
connections between nonmonotonic logic and paraconsistent  logic
(see, for example,  A.  I.  Arruda,  Mathematical logic in Latin
                                            For more, enter PAGE
 
?⊃
             Display 3/L/6
America (Proc. IV Latin Amer.  Sympos.  Math.  Logic,  Santiago,
1978),   pp.   1  -   41,  North-Holland,  Amsterdam,  1980;  MR
81i:03033),   in  particular,   by  trying  to  show  that   the
invalidated theorems of a nonmonotonic theory can be interpreted
as  the  ''inconsistent''   theorems  of  certain paraconsistent
theories correlated to it (cf.  the  reviewer,   Notre  Dame  J.
Formal Logic 15 (1974), 497 - 510; MR 50 #6841).)
  Reviewer: COSTA(DA), N. C. A. (Sao Paulo)
  Descriptors:   *MATHEMATICAL  LOGIC  AND  FOUNDATIONS -General
logic --Other  nonclassical  logic  (03B60);   COMPUTER  SCIENCE
(including AUTOMATA) -Artificial intelligence  --Problem solving
(68G20)
 
?⊃
             Display 3/L/7
    784871  81i#03036b
  Addendum: circumscription and other nonmonotonic formalisms.
  McCarthy, John
  Artificial Intelligence,   1980,   13, no. 1-2,   171 - 172.
  Document Type: Journal
  Special issue on nonmonotonic logic.
  Circumscription  constitutes a rule of conjecture which can be
used  by  a  person  or  program  for   ''jumping   to   certain
conclusions'':   the  objects  that  are shown to have a certain
property P by reasoning from certain facts A constitute all  the
objects  that  have  P.  In these two notes,  circumscription is
discussed.
  Reviewer: DA COSTA, N. C. A. (Sao Paulo)
  Descriptors:  *MATHEMATICAL  LOGIC  AND  FOUNDATIONS  -General
logic --None of the above, but in this section (03B99); COMPUTER
SCIENCE (including AUTOMATA) -Artificial intelligence  --Problem
solving (68G20)
 
?⊃
             Display 3/L/8
    784870  81i#03036a
  Circumscription -- a form of nonmonotonic reasoning.
  McCarthy, John
  Artificial Intelligence,   1980,   13, no. 1-2,   27 - 39.
  Document Type: Journal
  Special issue on nonmonotonic logic.
  Reviewer: DA COSTA, N. C. A. (Sao Paulo)
  Descriptors:   *MATHEMATICAL  LOGIC  AND  FOUNDATIONS -General
logic --None of the above, but in this section (03B99); COMPUTER
SCIENCE (including AUTOMATA) -Artificial intelligence  --Problem
solving (68G20)
 
?⊃
             Display 3/L/9
    771495  81d#68119
  Special issue on nonmonotonic logic.
  Contributors: Bobrow, Daniel G.
  Publ: North-Holland Publishing Co., Amsterdam
  1980,   pp. 1 - 174.
  Document Type: Book
  Special issue: Nonmonotonic logic; Nonmonotonic logic
  Edited by Daniel G. Bobrow. Artificial Intelligence 13 (1980),
no. 1-2,1 - 172.
  This  collection  contains  articles  which are being reviewed
individually.
  Reviewer: Editors
  Descriptors:  *COMPUTER SCIENCE (including AUTOMATA)  (68GXX);
MATHEMATICAL   LOGIC  AND  FOUNDATIONS  -General  logic  --Other
nonclassical  logic  (03B60);    COMPUTER   SCIENCE   (including
AUTOMATA) --Proceedings, conferences, etc. (68-06)
 
?⊃
          D
          Output completed, enter a new command
 
?⊃
 3/27/84  2:37:16  EST